Hierarchy Theorems for kOBDDs and kIBDDs
نویسندگان
چکیده
Beate Bollig , Martin Sauerho , Detlef Sieling , and Ingo Wegener FB Informatik, LS II, Univ. Dortmund, 44221 Dortmund, Germany bollig-, sauerhof-, sieling-, [email protected] Abstract Almost the same types of restricted branching programs (or binary decision diagrams BDDs) are considered in complexity theory and in applications like hardware veri cation. These models are read-once branching programs (free BDDs) and certain types of oblivious branching programs (ordered and indexed BDDs with k layers). The complexity of the satis ability problem for these restricted branching programs is investigated and tight hierarchy results are proved for the classes of functions representable by k layers of ordered or indexed BDDs of polynomial size.
منابع مشابه
The Linear Time Hierarchy Theorems for Abstract State Machines and RAMs
We prove the Linear Time Hierarchy Theorems for random access machines and Gurevich abstract state machines. One long-term goal of this line or research is to prove lower bounds for natural linear time problems.
متن کاملThe University of Chicago Hierarchy Theorems and Resource Tradeoffs for Semantic Classes a Dissertation Submitted to the Faculty of the Division of the Physical Sciences in Candidacy for the Degree of Doctor of Philosophy Department of Computer Science By
Computational complexity theory studies the minimum resources (time, space, randomness etc.) to solve computational problems. Two fundamental questions in this area are: 1. Can more problems be solved given more of a given resource? A positive answer to this question is known as a hierarchy theorem. 2. Can one resource be traded off with another when solving a given problem? Such a result is kn...
متن کاملA New Look at Some Classical Results in Computational Complexity
We propose a generalization of the traditional algorithmic space and time complexities. Using the concept introduced, we derive an unified proof for the deterministic time and space hierarchy theorems, now stated in a much more general setting. This opens the possibility for the unification and generalization of other results that apply to both the time and space complexities. As an example, we...
متن کاملReverse Mathematics
In math we typically assume a set of axioms to prove a theorem. In reverse mathematics, the premise is reversed: we start with a theorem and try to determine the minimal axiomatic system required to prove the theorem (over a weak base system). This produces interesting results, as it can be shown that theorems from different fields of math such as group theory and analysis are in fact equivalen...
متن کاملNote on Deduction Theorems in Contraction-Free Logics
In this short paper we present a finer analysis of the variants of Local Deduction Theorem in contraction-free logics. We define some natural generalisations called Implicational Deduction Theorems and study their basic properties. The hierarchy of classes of logics defined by these theorems is presented.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Theor. Comput. Sci.
دوره 205 شماره
صفحات -
تاریخ انتشار 1998